C-efficiency in nondifferentiable vector optimization
نویسندگان
چکیده
منابع مشابه
On Nondifferentiable and Nonconvex Vector Optimization Problems
In this paper, we prove the equivalence among the Minty vector variational-like inequality, Stampacchia vector variational-like inequality, and a nondifferentiable and nonconvex vector optimization problem. By using a fixed-point theorem, we establish also an existence theorem for generalized weakly efficient solutions to the vector optimization problem for nondifferentiable and nonconvex funct...
متن کاملSuper Efficiency in Vector Optimization
We introduce a new concept of efficiency in vector optimization. This concept, super efficiency, is shown to have many desirable properties. In particular, we show that in reasonable settings the super efficient points of a set are norm-dense in the efficient frontier. We also provide a Chebyshev characterization of super efficient points for nonconvex sets and a scalarization theory when the u...
متن کاملNondifferentiable Optimization via Approximation*
Optimization problems with nondifferentiable cost functionals, particularly minimax problems, have received considerable attention recently since they arise naturally in a variety of contexts. Optimality conditions for such problems have been derived by several authors while a number of computational methods have been proposed for their solution (the reader is referred to [1] for:a fairly compl...
متن کاملValues of nondifferentiable vector measure games
We introduce ideas and methods from distribution theory into value theory. This new approach enables us to construct new diagonal formulas for the Mertens value [5] and the Neyman value [6] on a large space of nondifferentiable games. This in turn enables us to give an affirmative answer to the question, first posed by Neyman [6], whether the Mertens value and the Neyman value coincide “modulo ...
متن کاملIncremental Subgradient Methods for Nondifferentiable Optimization
We consider a class of subgradient methods for minimizing a convex function that consists of the sum of a large number of component functions. This type of minimization arises in a dual context from Lagrangian relaxation of the coupling constraints of large scale separable problems. The idea is to perform the subgradient iteration incrementally, by sequentially taking steps along the subgradien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2013
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2012.10.015